Let $A = \{x_1, x_2, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. The total number of onto functions $f : A \to B$ such that there exist exactly three elements $x$ in $A$ with $f(x) = y_2$ is equal to:

  • A
    $14 \times {}^7C_3$
  • B
    $16 \times {}^7C_3$
  • C
    $14 \times {}^7C_2$
  • D
    $12 \times {}^7C_2$

Explore More

Similar Questions

Let $A = \{x : x \in R, x \text{ is not a positive integer}\}$. Define $f: A \rightarrow R$ as $f(x) = \frac{2x}{x-1}$. Then $f$ is:

Let $R$ denote the set of all real numbers and $R^{+}$ denote the set of all positive real numbers. For the subsets $A$ and $B$ of $R$,define $f: A \rightarrow B$ by $f(x) = x^2$ for $x \in A$. Match the items in Column-$I$ with the items in Column-$II$.
Column-$I$Column-$II$
$A$. $f$ is one-one and onto,if$1$. $A = R^{+}, B = R$
$B$. $f$ is one-one but not onto,if$2$. $A = B = R$
$C$. $f$ is onto but not one-one,if$3$. $A = R, B = R^{+}$
$D$. $f$ is neither one-one nor onto,if$4$. $A = B = R^{+}$

The function $f(x) = \frac{x^2+2x-15}{x^2-4x+9}$,$x \in R$ is

Let $A = \{0, 1, 2, 3, 4, 5, 6, 7\}$. Then the number of bijective functions $f: A \rightarrow A$ such that $f(1) + f(2) = 3 - f(3)$ is equal to $.....$

The number of functions $f:[0,1] \rightarrow [0,1]$ satisfying $|f(x)-f(y)|=|x-y|$ for all $x, y \in [0,1]$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo